Counting vertices and cubes in median graphs of circular split systems
نویسندگان
چکیده
Median graphs are a natural generalisation of trees and hypercubes that are closely related to distributive lattices and graph retracts. In the past decade, they have become of increasing interest to the biological community, where, amongst other things, they are applied to the study of evolutionary relationships within populations. Two simple measures of complexity for a median graph are the number of vertices and the number of maximal induced subcubes. These numbers can be useful in biological applications, and they are also of purely mathematical interest. However, they can be hard to compute in general. Here we present some special families of median graphs where it is possible to find formulae and recursions for these numbers. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar dual of a finite squaregraph is determined by a triangle-free chord diagram of the unit disk, which could alternatively be viewed as a triangle-free line ar...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملFast recognition algorithms for classes of partial cubes
Isometric subgraphs of hypercubes, or partial cubes as they are also called, are a rich class of graphs that include median graphs, subdivision graphs of complete graphs, and classes of graphs arising in mathematical chemistry and biology. In general one can recognize whether a graph on n vertices and m edges is a partial cube in O(mn) steps, faster recognition algorithms are only known for med...
متن کاملRelations between Median Graphs, Semi-median Graphs and Partial Cubes
A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for isometric subgraphs of hypercubes also known as partial cubes and for median graphs Median graphs which constitute a proper subclass of partial cubes have attracted considerable attention In order to better understand them semi median graphs have been introduced but have...
متن کاملPartial Cubes and Crossing Graphs
Partial cubes are defined as isometric subgraphs of hypercubes. For a partial cube G, its crossing graph G# is introduced as the graph whose vertices are the equivalence classes of the Djoković–Winkler relation Θ, two vertices being adjacent if they cross on a common cycle. It is shown that every graph is the crossing graph of some median graph and that a partial cube G is 2-connected if and on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008